Polling systems with breakdowns and repairs

REPAIRS Oren Nakdimon and Uri Yechiali Department of Statistics and Operations Research School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv 69978, Israel [Email: [email protected]; phone +972-3-6409637] Abstract This work analyzes various polling systems with both random breakdowns and repairs. A few works in the literature investigated polling networks with failing nodes, but none has treated the associated repair process or the combined e ect of breakdowns and repairs on such systems. We consider three service mechanisms: Gated, Exhaustive and Globally-Gated. For each service regime we study several variations, di ering from each other by (i) whether the arrival process to a queue being repaired continues or stops during the repair process, and (ii) whether the failure is observed immediately when it occurs or only at the end of a service duration. For each of the twelve models studied we provide analyses regarding the system state at polling instants (law of motion, probability generating functions, rst and second order moments) and derive expressions for several performance measures, such as (distribution and mean of) number of customers at the di erent queues, their waiting and sojourn times, server's cycle times, etc. We derive stability conditions for the various models and express all results in a uni ed generalized form.